Research on the Connecting Path Search Algorithm for Air-Rail Integration

نویسندگان

  • Tao Xu
  • Xiaolu Ding
  • Jianfu Li
چکیده

With the rapid development of high-speed railway and the changes of the tourists’ requirement, it is imperative to the integrate advantages of aviation and rail. This paper constructs the air-rail integration model based on the current development situation and characteristics of Chinese railways. In allusion to the search problem of connecting path in air-rail integration network, a constrained Yen* algorithm is proposed to solve the problem in this paper. The constrained Yen* algorithm is set up by using the heuristic strategy of A* algorithm and two certain constraints by reducing running time to generate candidate paths. The experimental results show that the search problem of connecting path in air-rail integration network can be obtained fast by the constrained Yen* algorithm. Therefore, constrained Yen* algorithm is more efficient than constrained Yen algorithm in application.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Corrector-predictor arc-search interior-point algorithm for $P_*(kappa)$-LCP acting in a wide neighborhood of the central path

In this paper, we propose an arc-search corrector-predictor interior-point method for solving $P_*(kappa)$-linear complementarity problems. The proposed algorithm searches the optimizers along an ellipse that is an approximation of the central path. The algorithm generates a sequence of iterates in the wide neighborhood of central path introduced by Ai and Zhang. The algorithm does not de...

متن کامل

Solving a New Multi-Period Mathematical Model of the Rail-Car Fleet Size and Car Utilization by Simulated Annealing

There is a significant interaction between sizing a fleet of rail cars and its utilization. This paper presents a new multi-period mathematical model and a solution procedure to optimize the rail-car fleet size and freight car allocation, wherein car demands, and travel times, are assumed to be deterministic, and unmet demands are backordered. This problem is considered NP-complete. In other wo...

متن کامل

A path-following infeasible interior-point algorithm for semidefinite programming

We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...

متن کامل

Developing Passenger Hub Location Problem Based on Origin-Destination Trips Derived by Gravity Model (Case Study of Iran's Rail Network)

Iran’s geographical situation, in particular long-distance routes, makes rail transportation to be more attractive and important than the other modes. Since transport cost is the main concern for local and national authorities, Hub location is an important problem in transport planning in which transport industries are looking for selected points to change trains for passengers. In this pap...

متن کامل

An Internet behavior management system based on Android

REGULAR PAPERS Extracting Feature Sequences in Software Vulnerabilities Based on Closed Sequential Pattern Mining Qunhui Wu, Shilong Ma, and Hao Wang The Complex Product Design Modeling Based on Spatial Sequence Colored Petri-nets Yongtao Hao, Peng Dai and Diming Lou Text Image with Complex Background Filtering Method Based on Harris Corner-point Detection Fanfeng Zeng, Guofeng Zhang, and Jin J...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JSW

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2013